Border correlation of binary words

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Border correlation of binary words

The border correlation function β : A → A, for A = {a, b}, specifies which conjugates (cyclic shifts) of a given word w of length n are bordered, i.e., β(w) = b0b1 . . . bn−1, where bi = a or b according to whether the i-th cyclic shift σ(w) of w is unbordered or bordered. Except for some special cases, no binary word w has two consecutive unbordered conjugates (σ(w) and σ(w)). We show that thi...

متن کامل

Periods and Binary Words

We give an elementary short proof for a well-known theorem of Guibas and Odlyzko stating that the sets of periods of words are independent of the alphabet size. As a consequence of our constructing proof, we give a linear time algorithm which, given a word, computes a binary one with the same periods. We give also a very short proof for the famous Fine and Wilf's periodicity lemma.

متن کامل

Binary amiable Words

1 This paper is dedicated to my colleague and friend Alexandru Mateescu, the first author of Parikh matrix mapping.

متن کامل

Oracles for Binary Words

The paper proposes a solution to the problem of finding an unspecified binary sequence of known length, using an oracle. Three oracles are defined and used in construction of linear algorithms, with the aim of finding an unknown word α. These algoritms build α by by generating all its prefixes, knowing a specified subword, or using a distance defined on sequences of the same length.

متن کامل

Parity Index of Binary Words and Powers of Prime Words

Let f be a binary word and let Fd(f) be the set of words of length d which do not contain f as a factor (alias words that avoid the pattern f). A word is called even/odd if it contains an even/odd number of 1s. The parity index of f (of dimension d) is introduced as the difference between the number of even words and the number of odd words in Fd(f). A word f is called prime if every nontrivial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2004

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2004.07.009